Minimizing the sum of diameters efficiently
نویسندگان
چکیده
منابع مشابه
Minimizing Diameters of Dynamic Trees
In this paper we consider an on{line problem related to minimizing the diameter of a dynamic tree T. A new edge f is added, and our task is to delete the edge e of the induced cycle so as to minimize the diameter of the resulting tree T ffgnfeg. Starting with a tree with n nodes, we show how each such best swap can be found in worst{case O(log 2 n) time. The problem was raised by Italiano and R...
متن کاملMinimizing the sum of many rational functions
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree of each term should be small (up to 10), and the number of variables can be large (10 to 100) provided some kind of sparsity is present. We describe a formulation of the rational optimization problem as a generalized m...
متن کاملApproximation Algorithms for Clustering to Minimize the Sum of Diameters
We consider the problem of partitioning the nodes of a complete edge weighted graph into k clusters so as to minimize the sum of the diameters of the clusters. Since the problem is NP-complete, our focus is on the development of good approximation algorithms. When edge weights satisfy the triangle inequality, we present the rst approximation algorithm for the problem. The approximation algorith...
متن کاملMinimizing a sum of submodular functions
We consider the problem of minimizing a function represented as a sum of submodular terms. We assume each term allows an efficient computation of exchange capacities. This holds, for example, for terms depending on a small number of variables, or for certain cardinalitydependent terms. A naive application of submodular minimization algorithms would not exploit the existence of specialized excha...
متن کاملMulti Cover of a Polygon Minimizing the Sum of Areas
We consider a geometric optimization problem that arises in sensor network design. Given a polygon P (possibly with holes) with n vertices, a set Y of m points representing sensors, and an integer k, 1 ≤ k ≤ m. The goal is to assign a sensing range, ri, to each of the sensors yi ∈ Y , such that each point p ∈ P is covered by at least k sensors, and the cost, ∑ i r α i , of the assignment is min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1992
ISSN: 0925-7721
DOI: 10.1016/0925-7721(92)90028-q